/*
 *  Copyright (c) 2011 Mathew Hall.
 *  All rights reserved.
 * 
 *  Redistribution and use in source and binary forms, with or
 *  without modification, are permitted provided that the following conditions
 *  are met:
 * 
 *  Redistributions of source code must retain the above copyright
 *  notice, this list of conditions and the following disclaimer.
 *  Redistributions in binary form must reproduce the above
 *  copyright notice, this list of conditions and the following
 *  disclaimer in the documentation and/or other materials provided
 *  with the distribution.
 *  Neither the name of the University of Sheffield nor the names of its
 *  contributors may be used to endorse or promote products derived
 *  from this software without specific prior written permission.
 * 
 *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
 *  CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
 *  INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
 *  MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 *  DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
 *  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 *  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 *  NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 *  HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 *  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
 *  OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
 *  EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package searcher.fitnessfunction.util;

import primitives.graph.Node;
import java.io.File;
import java.io.IOException;
import org.junit.After;
import org.junit.AfterClass;
import org.junit.Before;
import org.junit.BeforeClass;
import org.junit.Test;
import primitives.cluster.ClusterHead;
import primitives.cluster.ClusterUtils;
import primitives.cluster.IClusterLevel;
import primitives.graph.Graph;
import primitives.util.UndefinedIndexException;
import search.fitnessfunctions.util.EdgeSubsumptionTransformer;
import search.util.TreeLoader;

import static org.junit.Assert.*;

/**
 *
 * @author Mathew Hall
 */
public class EdgeSubsumptionTransformationTest {

    private ClusterHead tree;
    private IClusterLevel toSubsume;
    private Graph g;

    public EdgeSubsumptionTransformationTest() {
    }

    @BeforeClass
    public static void setUpClass() throws Exception {
    }

    @AfterClass
    public static void tearDownClass() throws Exception {
    }

    @Before
    public void setUp() throws IOException, UndefinedIndexException {
        tree = TreeLoader.loadTreeFromDot(new File("/Users/mat/Dropbox/graphs/dot/fig3.dot"));

        ClusterUtils.merge(ClusterUtils.lookupIndexInTree(4, tree), ClusterUtils.lookupIndexInTree(1, tree), tree);



        toSubsume = ClusterUtils.lookupIndexInTree(2, tree);
    }

    @After
    public void tearDown() {
    }

    // TODO add test methods here.
    // The methods must be annotated with annotation @Test. For example:
    //
    // @Test
    // public void hello() {}
    @Test
    public void testSubsume() {
        
        
        int numNodes = tree.getNodes().size();
        
        for(Node n : tree.getNodes()){
        //    System.out.println(n);
        }
        
        int numChildren = tree.getChildren().size();
        
        EdgeSubsumptionTransformer.subsumeNodeInClustered(toSubsume, tree);
        System.out.println(String.format("a:%d e not:%d",tree.getNodes().size(),numNodes));
        assertNotSame(tree.getNodes().size(), numNodes);
        assertNotSame(tree.getChildren().size(), numChildren);
        
        for(Node n : tree.getNodes()){
        //    System.out.println(n);
        }
        
        
    }
}